On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
نویسندگان
چکیده
منابع مشابه
On the partition dimension and connected partition dimension of wheels
Let G be a connected graph. For a vertex v ∈ V (G) and an ordered k-partition Π = {S1, S2, ..., Sk} of V (G), the representation of v with respect to Π is the k-vector r(v|Π) = (d(v, S1), d(v, S2), ..., d(v, Sk)). The k-partition Π is said to be resolving if the k-vectors r(v|Π), v ∈ V (G), are distinct. The minimum k for which there is a resolving k-partition of V (G) is called the partition d...
متن کاملBoron-nitride nanotube triggered self-assembly of hexagonal boron-nitride nanostructure.
Molecular mechanics results show that a hexagonal boron nitride (h-BN) membrane can spontaneously assemble on the single-walled boron nitride nanotube (BNNT) in a scroll or helical manner, showing an interesting dependence on h-BN width. The size of BNNTs should meet the required conditions to guarantee self-assembly. Further analyses of energy components and structural geometry show that this ...
متن کاملTOPICAL REVIEW Graphene on Hexagonal Boron Nitride
The field of graphene research has developed rapidly since its first isolation by mechanical exfoliation in 2004. Due to the relativistic Dirac nature of its charge carriers, graphene is both a promising material for next-generation electronic devices and a convenient low-energy testbed for intrinsically high-energy physical phenomena. Both of these research branches require the facile fabricat...
متن کاملOn the partition dimension of trees
Given an ordered partition Π = {P1, P2, ..., Pt} of the vertex set V of a connected graph G = (V,E), the partition representation of a vertex v ∈ V with respect to the partition Π is the vector r(v|Π) = (d(v, P1), d(v, P2), ..., d(v, Pt)), where d(v, Pi) represents the distance between the vertex v and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have ...
متن کاملOn the Strong Partition Dimension of Graphs
We present a new style of metric generator in graphs. Specifically we introduce a metric generator based on a partition of the vertex set of a graph. The sets of the partition will work as the elements which will uniquely determine the position of each single vertex of the graph. A set W of vertices of a connected graph G strongly resolves two different vertices x, y / ∈ W if either dG(x,W ) = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3071716